Relational Association Rules: Getting WARMeR

نویسندگان

  • Bart Goethals
  • Jan Van den Bussche
چکیده

In recent years, the problem of association rule mining in transactional data has been well studied. We propose to extend the discovery of classical association rules to the discovery of association rules of conjunctive queries in arbitrary relational data, inspired by the Warmr algorithm, developed by Dehaspe and Toivonen, that discovers association rules over a limited set of conjunctive queries. Conjunctive query evaluation in relational databases is well understood, but still poses some great challenges when approached from a discovery viewpoint in which patterns are generated and evaluated with respect to some well defined search space and pruning operators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Association Rules in the Relational Calculus

One of the most utilized data mining tasks is the search for association rules. Association rules represent significant relationships between items in transactions. We extend the concept of association rule to represent a much broader class of associations, which we refer to as entity-relationship rules. Semantically, entity-relationship rules express associations between properties of related ...

متن کامل

Using relational operations to express association rules

Association rules are essential data mining tool. There exist many types of them. Indeed, association rules of different types have often completely dissimilar syntax. In this paper, we try to design a framework based on relational operations enabling one to express various association rules using the same syntax. Doing so we will be able to study association rules at high level – it will be po...

متن کامل

Mining Relational Association Rules for Propositional Classification

In traditional classification setting, training data are represented as a single table, where each row corresponds to an example and each column to a predictor variable or the target variable. However, this propositional (featurebased) representation is quite restrictive when data are organized into several tables of a database. In principle, relational data can be transformed into propositiona...

متن کامل

Defect Classification using Relational Association Rule Mining Based on Fuzzy Classifier along with Modified Artificial Bee Colony Algorithm

In this study, we introduce a method for defect classification using relational association rule mining based on fuzzy classifier along with modified artificial bee colony algorithm. Relational association rules are an extension of ordinal association rules, which are a particular type of association rules that describe numerical orderings between attributes that commonly occur in the data. The...

متن کامل

Association Rules for Predicting Customer Lifetime Value in Retail Banking Context Based on RDB- MINER Algorithm

Data mining methodology has a tremendous contribution for extracting the hidden knowledge and patterns from the existing databases. Traditionally, researchers use basket data to mine association rules of which the basic task is to find the frequent items. For relational databases whose data format is relational data other than basket data, RDB-MINER algorithm was proposed. In this paper, we int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002